Constraint Satisfaction Approach on Product Configuration with Cost Estimation

نویسندگان

  • Lin Wang
  • Wee Keong Ng
  • Bing Song
چکیده

Due to the dynamism and heterogeneity of today’s markets, mass customization has been widely applied in the manufacturing industry with the objective of satisfying individual customer needs while maintaining near mass production efficiency. Product family design is an effective approach for mass customization where problem modeling and solution are two significant concerns. As a large amount of data with diverse variety need to be represented (including production data, customer requirements and design knowledge), powerful knowledge representation models are necessary to capture the large variety and complexity of data. Given a configuration problem description and representation, efficient reasoning methods are also required for configuration solution search and optimization. Cost is a critical composition and criterion for product family design; however, the integration of cost estimation and product family design has not been successfully addressed. In this thesis, an extended Dynamic Constraint Satisfaction Problem (DCSP) based product configuration and cost estimation system is proposed to to effectively represent the large amount of data with great variety and complexity in product family design as DCSP terms (i.e., variables, domains and constraints). In the extended DCSP-based system, structural constraints are proposed to capture the inherent hierarchy among modules and components. Activation constraints are composed to represent derivation relationships among variables in the extended DCSP-based system. As both structural and activation constraints can activate variables into the DCSP according to triggering conditions (i.e., hierarchical and derivation relationships among variables), they are utilized to dynamically extend the search space of

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration

Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be conveniently formulated as a Constraint Satisfaction Problem where the constraints are propositional formulas. The problem of interactive configuration was originally inspired by the product configuration problem with the emerg...

متن کامل

FdConfig: A Constraint-Based Interactive Product Configurator

We present a constraint-based approach to interactive product configuration. Our configurator tool FdConfig is based on feature models for the representation of the product domain. Such models can be directly mapped into constraint satisfaction problems and dealt with by appropriate constraint solvers. During the interactive configuration process the user generates new constraints as a result o...

متن کامل

Morphos Configuration Engine: the Core of a Commercial Configuration System in CLP(FD)

Product configuration systems are an emerging software technology that supports companies in deploying mass customization strategies. In this paper, we describe a CLP-based reasoning engine that we developed for a commercial configuration system. We first illustrate the advantages of the CLP approach to product configuration over other ones. Then, we describe the actual encoding of the consider...

متن کامل

Automated Reasoning for Multi-step Software Product-line Configuration Problems

The increasing complexity and cost of softwareintensive systems has led developers to seek ways of reusing software components across development projects. One approach to increasing software reusability is to develop a Software Product-line (SPL), which is a software architecture that can be reconfigured and reused across projects. Rather than developing software from scratch for a new project...

متن کامل

Towards Engineer-to-order Product Configuration

Constraint satisfaction problem (CSP) paradigm has proved highly successful for solving product configuration problems, particularly for build-to-order configuration in determining combination of different predefined component types. However, many real world customized products deal with engineer-to-order configuration, where product configuration is generated not only from combinations of diff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009